- The last nodes of the tree is called 'leaves'
- Process of navigating the tree is "traversal"
- A node with at least one child is called "internal node"
- Total number of children of a node is "degree of that node"
- The number of edges from node A to root node is the "depth of the node"
- The number of edges from root node to leaf is the "height of the node"
- The Red-Black tree is one such configuration of the binary search tree that makes the insertion and deletion process more efficient.
- The largest number is at the rightside, the smallest number is on the leftside
- Just like in binary number system where there's only two digits, the binary tree also only have maximum two subtree/child that a parent can have.